منابع مشابه
The Analytic Polynomial Time Hierarchy
Motivated by results on interactive proof systems we investigate an 9-8-hierarchy over P using word quantifiers as well as two types of set quantifiers. This hierarchy, which extends the (arithmetic) polynomial-time hierarchy, is called the analytic polynomial-time hierarchy. It is shown that every class of this hierarchy coincides with one of the following classes: pk, pk (k 0), PSPACE, exp k ...
متن کاملPolynomial-time hierarchy of computable reals
In mathematics, various representations of real numbers have been investigated and all these representations are proved to be mathematically equivalent. Furthermore, it is known that all effective versions of these representations lead to the same class of “computable real numbers”. However, when subrecursive (such as primitive recursive) is taken into account, these representations can lead to...
متن کاملThe Promise Polynomial Hierarchy
The polynomial hierarchy is a grading of problems by difficulty, including P, NP and coNP as the best known classes. The promise polynomial hierarchy is similar, but extended to include promise problems. It turns out that the promise polynomial hierarchy is considerably simpler to work with, and many open questions about the polynomial hierarchy can be resolved in the promise polynomial hierarc...
متن کاملLecture 9 : Polynomial - Time Hierarchy , Time - Space Tradeoffs
Last time we defined problems EXACT -INDSET = {[G, k] | the largest independent set of G has size = k}, MINDNF = {[φ, k] | φ is a DNF that has an equivalent DNF of size ≤ k}, and the complexity classes Σ2 and its dual Π P 2 . Σ P 2 and Π P 2 were defined in analogy with NP and coNP except that there are two levels of quantifiers with alternation ∃∀ and ∀∃, respectively. We observed that MINDNF ...
متن کاملPolynomial-Length Planning Spans the Polynomial Hierarchy
This paper presents a family of results on the computational complexity of the decision problem associated with planning: Does a valid plan exist? We consider the effect on complexity of several assumptions typical of classical planning: complete knowledge of the initial state, determinism, polynomial-time determination of executability of actions in a state. We consider plans of two types: con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1976
ISSN: 0304-3975
DOI: 10.1016/0304-3975(76)90061-x